Longest Gapped Repeats and Palindromes

نویسندگان

  • Marius Dumitran
  • Florin Manea
چکیده

A gapped repeat (respectively, palindrome) occurring in a word w is a factor uvu (respectively, uvu) of w. In such a repeat (palindrome) u is called the arm of the repeat (respectively, palindrome), while v is called the gap. We show how to compute efficiently, for every position i of the word w, the longest gapped repeat and palindrome occurring at that position, provided that the length of the gap is subject to various types of restrictions. That is, that for each position i we compute the longest prefix u of w[i..n] such that uv (respectively, uv) is a suffix of w[1..i−1] (defining thus a gapped repeat uvu – respectively, palindrome uvu), and the length of v is subject to the aforementioned restrictions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gapped Pattern Statistics

We give a probabilistic analysis of parameters related to α-gapped repeats and palindromes in random words, under both uniform and memoryless distributions (where letters have different probabilities, but are drawn independently). More precisely, we study the expected number of maximal α-gapped patterns, as well as the expected length of the longest α-gapped pattern in a random word. 1998 ACM S...

متن کامل

Improved Upper Bounds on all Maximal $\alpha$-gapped Repeats and Palindromes

We show that the number of all maximal α-gapped repeats and palindromes of a word of length n is at most 3(π/6 + 5/2)αn and 7(π/6 + 1/2)αn − 5n− 1, respectively.

متن کامل

Repeats and Palindromes: an Overview

With a long text string like DNA, repeats and palindromes are not easily spotted. Yet nding such substrings is important; for instance, repeats in DNA are indicators of certain hereditary disorders and are used as genetic markers. We discuss repeats and then palindromes and then we relate the two. In our discussion of repeats, we rst de ne an exact repeat and then ve de nitions of approximate r...

متن کامل

Computing Longest Single-arm-gapped Palindromes in a String

In this paper, we introduce new types of approximate palindromes called singlearm-gapped palindromes (shortly SAGPs). A SAGP contains a gap in either its left or right arm, which is in the form of either wgucuw or wucugw, where w and u are non-empty strings, w and u are respectively the reversed strings of w and u, g is a gap, and c is either a single character or the empty string. We classify ...

متن کامل

Efficiently Finding All Maximal alpha-gapped Repeats

For α ≥ 1, an α-gapped repeat in a word w is a factor uvu of w such that |uv| ≤ α|u|; the two factors u in such a repeat are called arms, while the factor v is called gap. Such a repeat is called maximal if its arms cannot be extended simultaneously with the same symbol to the right or, respectively, to the left. In this paper we show that the number of maximal α-gapped repeats that may occur i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015